Some Results for Skip-free Random Walk
نویسندگان
چکیده
A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are much more difficult in general cases. Although some of the results in this article have appeared elsewhere, our proof approach is different.
منابع مشابه
Positivity of Integrated Random Walks
Take a centered random walk Sn and consider the sequence of its partial sums An := ∑n i=1 Si. Suppose S1 is in the domain of normal attraction of an α-stable law with 1 < α ≤ 2. Assuming that S1 is either right-exponential (that is P(S1 > x|S1 > 0) = e−ax for some a > 0 and all x > 0) or right-continuous (skip free), we prove that P { A1 > 0, . . . , AN > 0 } ∼ CαN 1 2α− 1 2 as N → ∞, where Cα ...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملSkip-graph: Learning Graph Embeddings with an Encoder-decoder Model
In this work, we study the problem of feature representation learning for graphstructured data. Many of the existing work in the area are task-specific and based on supervised techniques. We study a method for obtaining a generic feature representation for a graph using an unsupervised approach. The neural encoderdecoder model is a method that has been used in the natural language processing do...
متن کاملRevisit to the tail asymptotics of the double QBD process: Refinement and complete solutions for the coordinate and diagonal directions
We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics for the stationary probabilities on the coordinate axis. This refines the asymptotic results in the literature, and completely solves the tail asymptotic pro...
متن کاملOn hitting times and fastest strong stationary times for skip-free chains
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues νj of the generat...
متن کامل